A Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems

Authors

  • S. H. Zahiri Electrical and Computer Faculty, University of Birjand, Birjand, Iran.
  • S. M. Ejabati Electrical and Computer Faculty, University of Birjand, Birjand, Iran.
Abstract:

In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the number of algorithm individuals and the creation of feasible subspaces appropriate to environmental conditions. Accordingly, to prevent early convergence along with the increasing speed of local search, the search space is divided with respect to the conditions of each moment into subspaces labeled as focused search area, and focused individuals are recruited to make search for it. Moreover, the structure of the design is in such a way that it often adapts itself to environmental condition, and there is no need to identify any change in the environment. The framework proposed for particle swarm optimization algorithm has been implemented as one of the most notable static optimization and a new optimization method referred to as ant lion optimizer. The results from moving peak benchmarks (MPB) indicated the good performance of the proposed framework for dynamic optimization. Furthermore, the positive performance of practices was assessed with respect to real-world issues, including clustering for dynamic data.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Adapting Genetic Algorithms for Combinatorial Optimization Problems in Dynamic Environments

Combinatorial optimization problems (COPs) have a wide range of applications in engineering, operation research, and social sciences. Moreover, as real-time information and communication systems become increasingly available and the processing of real-time data becomes increasingly affordable, new versions of highly dynamic real-world applications are created. In such applications, information ...

full text

a framework for identifying and prioritizing factors affecting customers’ online shopping behavior in iran

the purpose of this study is identifying effective factors which make customers shop online in iran and investigating the importance of discovered factors in online customers’ decision. in the identifying phase, to discover the factors affecting online shopping behavior of customers in iran, the derived reference model summarizing antecedents of online shopping proposed by change et al. was us...

15 صفحه اول

diagnostic and developmental potentials of dynamic assessment for writing skill

این پایان نامه بدنبال بررسی کاربرد ارزیابی مستمر در یک محیط یادگیری زبان دوم از طریق طرح چهار سوال تحقیق زیر بود: (1) درک توانایی های فراگیران زمانیکه که از طریق برآورد عملکرد مستقل آنها امکان پذیر نباشد اما در طول جلسات ارزیابی مستمر مشخص شوند; (2) امکان تقویت توانایی های فراگیران از طریق ارزیابی مستمر; (3) سودمندی ارزیابی مستمر در هدایت آموزش فردی به سمتی که به منطقه ی تقریبی رشد افراد حساس ا...

15 صفحه اول

Clustering and Memory-based Parent-Child Swarm Meta-heuristic Algorithm for Dynamic Optimization

So far, various optimization methods have been proposed, and swarm intelligence algorithms have gathered a lot of attention by academia. However, most of the recent optimization problems in the real world have a dynamic nature. Thus, an optimization algorithm is required to solve the problems in dynamic environments well. In this paper, a novel collective optimization algorithm, namely the Clus...

full text

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 16  issue 2

pages  158- 173

publication date 2020-06

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023